Design and Performance Evaluation of Distributed Active Queue Management Mechanism Cooperating among Multiple Routers
نویسندگان
چکیده
In recent years, AQM (Active Queue Management) mechanisms, which control the number of packets in the router’s buffer by discarding an arriving packet, have been actively studied. In past studies, most of AQM mechanisms have been designed by taking account of a single router; i.e., few AQM mechanisms have been designed by taking account of multiple routers in the network. In a general network with multiple routers and heterogeneous TCP connections, it is known that the bandwidth allocation to TCP (Transmission Control Protocol) connections satisfies F A fairness criterion. This means that the throughput of TCP connection tends to be high when its propagation delay and/or the number of its traversing links is small. In this paper, we focus on such a general network, and design an AQM mechanism that cooperates with other routers for improving the fairness among heterogeneous TCP connections. In our AQM mechanism, ECN (Explicit Congestion Notification) mechanism is used for differentiating the packet marking probability of RED according to CE (Congestion Experienced) bit of an arriving packet. We analyze the steady state behavior of our proposed AQM mechanism, and show that the fairness among TCP connections is improved compared with the RED router.
منابع مشابه
VRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملDesigning AQM Mechanism for Improving Fairness among TCP Connections in Tandem Networks
In recent years, AQM (Active Queue Management) mechanisms, which control the number of packets in the router’s buffer by randomly discarding an arriving packet, have been actively studied. In past studies, most of AQM mechanisms have been designed by taking account of a single router; i.e., few AQM mechanisms have been designed by taking account of multiple routers in the network. In a tandem n...
متن کاملDynamic-CBT – Router Queue Management for Improved Multimedia Performance on the Internet
The explosive increase in Internet traffic has placed a growing emphasis on congestion control and fairness in Internet routers. Approaches to the problem of congestion, such as active queue management schemes like Random Early Detection (RED) that are successful with TCP flows, use congestion avoidance techniques. Approaches to the problem of fairness, such as Fair Random Early Drop (FRED), pu...
متن کاملDSRED: A New Queue Management Scheme for the Next Generation Internet
Random Early Detection (RED), an active queue management scheme, has been recommended by the Internet Engineering Task Force (IETF) for the next generation routers. RED suffers from a number of performance problems, such as low throughput, large delay/jitter, and induces instability in networks. Many of the previous attempts to improve the performance of RED have been based on optimizing the va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003